Refinability of splines from lattice Voronoi cells
نویسنده
چکیده
Splines can be constructed by convolving the indicator function of the Voronoi cell of a lattice. This paper presents simple criteria that imply that only a small subset of such spline families can be refined: essentially the well-known box splines and tensor-product splines. Among the many non-refinable constructions are hex-splines and their generalization to non-Cartesian lattices. An example shows how non-refinable splines can exhibit increased approximation error upon refinement of the lattice.
منابع مشابه
Refinability of splines derived from regular tessellations
Splines can be constructed by convolving the indicator function of a cell whose shifts tessellate Rn. This paper presents simple, geometric criteria that imply that, for regular shift-invariant tessellations, only a small subset of such spline families yield nested spaces: primarily the well-known tensor-product and box splines. Among the many nonrefinable constructions are hex-splines and thei...
متن کاملVoronoi Cells of Lattices with Respect to Arbitrary Norms
Motivated by the deterministic single exponential time algorithm of Micciancio and Voulgaris for solving the shortest and closest vector problem for the Euclidean norm, we study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms. On the positive side, we show that for strictly convex and smooth norms the geometry of Voronoi cells of lattices in any dimensio...
متن کاملShort Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing
Improving on the Voronoi cell based techniques of [28, 24], we give a Las Vegas Õ(2n) expected time and space algorithm for CVPP (the preprocessing version of the Closest Vector Problem, CVP). This improves on the Õ(4n) deterministic runtime of the Micciancio Voulgaris algorithm [24] (henceforth MV) for CVPP 1 at the cost of a polynomial amount of randomness (which only affects runtime, not cor...
متن کاملSplines over iterated Voronoi diagrams Draft
We present a surface generation method which produces B-spline-like surfaces (or curves) in any dimension. We focus on the 2D quadratic case.
متن کاملComplexity and algorithms for computing Voronoi cells of lattices
In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm for this problem which is especially suited for low dimensional (say dimensions at most 12) and for highly-symmetric lattices. We use our implementation, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1209.5826 شماره
صفحات -
تاریخ انتشار 2012